Verifiable Mixing (Shuffling) of ElGamal Pairs
نویسنده
چکیده
We give an improved presentation of the protocol first published in [23]. That paper contained some minor misprints, and was thin on formal proofs of correctness; both shortcomings are addressed in the current version. We also make some brief comparisons with, and criticisms of some more recent publications which build on the results presented in [23]. In particular, we point out that, in contrast to other protocols, the protocol of this paper is unconditionally sound.
منابع مشابه
Efficient and Verifiable Shuffling and Shuffle-Decryption
In this paper, we propose an efficient protocol for proving the correctness of shuffling and an efficient protocol for simultaneously proving the correctness of both shuffling and decryption. The former protocol is the most efficient in computational and communication complexity among 3-move honest verifier perfect zero-knowledge protocols for proving a shuffling of ElGamal cipher-texts. The la...
متن کاملEfficient, Verifiable Shuffle Decryption and Its Requirement of Unlinkability
In this paper, we propose a scheme to simultaneously prove the correctness of both shuffling and decryption. Our scheme is the most efficient of all previous schemes, as a total, in proving the correctness of both shuffling and decryption of ElGamal ciphertexts. We also propose a formal definition for the core requirement of unlinkability in verifiable shuffle-decryption, and then prove that ou...
متن کاملVerifiable Rotation of Homomorphic Encryptions
Similar to verifiable shuffling (mixing), we consider the problem of verifiable rotating a given list of homomorphic encryptions. The offset by which the list is rotated (cyclic shift) should remain hidden. Basically, we will present zero-knowledge proofs of knowledge of a rotation offset and re-encryption exponents, which define how the input list is transformed into the output list. We also b...
متن کاملEfficient and General PVSS Based on ElGamal Encryption
PVSS stands for publicly verifiable secret sharing. In PVSS, a dealer shares a secret among multiple share holders. He encrypts the shares using the shareholders' encryption algorithms and publicly proves that the encrypted shares are valid. Most of the existing PVSS schemes do not employ an ElGamal encryption to encrypt the shares. Instead, they usually employ other encryption algorithms like ...
متن کاملParallel Shuffling and Its Application to Prêt à Voter
We consider the problem of verifiable parallel shuffling in which the same shuffle is simultaneously performed on two or more lists of input ciphertexts, each list encrypted under a different key. We present three parallelisations of shuffle proofs from different paradigms. The properties of each protocol are analyzed and contrasted, and their suitability for electronic voting discussed. We sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003